Using Preprocessing in Blind Source Separation of Convolutive Mixtures to accelerate Convergence
نویسندگان
چکیده
Blind source separation is an important task for applications in biomedical engineering, signal proo cessing and communications. In order to get too wards on-line time-variant applications, the converr gence speed of a separation algorithm has to be fast enough to track the changes of the environment. In this paper, a two-stage algorithm for blind source separation of convolutive mixtures in case of minii mum-phase mixing systems is presented. Thereby, a preprocessing of the observed signals is proposed in order to reduce the number of coeecients in the demixing system which is realized according to the information maximization approach by Bell and See jnowski. The reduction of the amount of paramee ters to adapt increases the algorithm's convergence speed signiicantly.
منابع مشابه
Blind separation of convolutive mixtures of cyclostationary sources using an extended natural gradient method
An on-line adaptive blind source separation algorithm for the separation of convolutive mixtures of cyclostationary source signals is proposed. The algorithm is derived by a p plying natural gradient iterative learning to the novel cost function which is delined according to the wide sense cyclostationarity of signals. The efficiency of the algorithm is supported by simulations, which show that...
متن کاملOn blind source separation using mutual information criterion
We address the problem of blind separation of instantaneous and convolutive mixtures of independent signals. We formulate this problem as an optimization problem using the mutual information criterion. In the case of instantaneous mixtures, we solve the resulting optimization problem with an extended Newton’s method on the Stiefel manifold. This approach works for general independent signals an...
متن کاملA Gauss-Newton method for blind source separation of convolutive mixtures
In this paper we present several Gauss-Newton algorithms for blind source separation of convolutive mixtures. The algorithms can be interpreted as generalizations of two previous approaches due to Gerven-Compernolle [7] and Nguyen-Jutten [5]. Since they are of the Gauss-Newton type, they exhibit a fast rate of convergence. Also, we present a stability analysis for two sources and instantaneous ...
متن کاملA Block-Adaptive Subspace Method Using Oblique Projections for Blind Separation of Convolutive Mixtures
This paper presents a block-adaptive subspace algorithm via oblique projection for blind source separation (BSS) problem of convolutive mixtures. In the proposed algorithm, the problem is reformulated into the one of instantaneous mixtures through oblique projections within one block, and then the separation matrix and other model parameters are updated by any static separation approach in a bl...
متن کاملA Joint Diagonalization Method for Convolutive Blind Separation of Nonstationary Sources in the Frequency Domain
A joint diagonalization algorithm for convolutive blind source separation by explicitly exploiting the nonstationarity and second order statistics of signals is proposed. The algorithm incorporates a non-unitary penalty term within the cross-power spectrum based cost function in the frequency domain. This leads to a modification of the search direction of the gradient-based descent algorithm an...
متن کامل